Commutation-augmented pregroup grammars and push-down automata with cancellation
نویسندگان
چکیده
منابع مشابه
Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars
A family of languages is called mildly context-sensitive if – it includes the family of all -free context-free languages; – it contains the languages • {anbncn : n ≥ 1} – multiple agreement, • {ambncmdn : m,n ≥ 1} – crossed dependencies, and • {ww : w ∈ Σ+} – reduplication; – all its languages are semi-linear; and – their membership problem is decidable in polynomial time. In our paper we intro...
متن کاملPush-Down Automata with Gap-Order Constraints
We consider push-down automata with data (PDAD) that operate on variables ranging over the set of natural numbers. The conditions on variables are defined via gap-order constraint. Gap-order constraints allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. The messages inside the stack are equipped with values that ...
متن کاملPregroup Grammars for Chords
Pregroups had been conceived as an algebraic tool to recognize grammatically well-formed sentences in natural languages [3]. Here we wish to use pregroups to recognize well-formed chords of pitches, for a given definition of those chords. We show how a judicious choice of basic and simple types allows a context-free grammatical description. Then we use the robustness property to extend the set ...
متن کاملMulti-Push-Down Languages and Grammars
A new class of languages, called multi-push-down (mpd), that generalize the classical context-free (cf, or Chomsky type 2) ones is introduced. These languages preserve some important properties of cf languages: a generalization of the Chomsky-Schh utzenberger homomorphic characterization theorem, the Parikh theorem and a \pumping lemma" are proved. Multi-push-down languages are an AFL. Their re...
متن کاملPregroup Grammars with Letter Promotions
We study pregroup grammars with letter promotions p ⇒ q. We show that the Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p is counted as |n| + 1. In Mater and Fix [9], the problem is shown NP-complete, but that proof assumes the binary (or decimal, etc.) representation of n in p, which seems less natural for applications. We reduce the problem to a graph-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2008
ISSN: 0890-5401
DOI: 10.1016/j.ic.2008.03.004